An Exact Method for the Maximum Diversity Problem
نویسنده
چکیده
In this article we first review previous integer formulations for the maximum diversity problem. This problem consists of selecting a subset of elements from a data set in such a way that the sum of the distances between the chosen elements is maximized. We propose a branch and bound algorithm and expressions for upper bounds for this problem. As far as we know, this is the first exact algorithm proposed for the maximum diversity problem. Empirical results with a collection of previously reported instances indicate that the proposed algorithm is able to solve medium size instances and compares favorably with the well-known optimizer Cplex when solving the previous formulations.
منابع مشابه
An Algorithm based on Predicting the Interface in Phase Change Materials
Phase change materials are substances that absorb and release thermal energy during the process of melting and freezing. This characteristic makes phase change material (PCM) a favourite choice to integrate it in buildings. Stephan problem including melting and solidification in PMC materials is an practical problem in many engineering processes. The position of the moving boundary, its veloci...
متن کاملExact maximum coverage probabilities of confidence intervals with increasing bounds for Poisson distribution mean
A Poisson distribution is well used as a standard model for analyzing count data. So the Poisson distribution parameter estimation is widely applied in practice. Providing accurate confidence intervals for the discrete distribution parameters is very difficult. So far, many asymptotic confidence intervals for the mean of Poisson distribution is provided. It is known that the coverag...
متن کاملSolving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کاملCritical Path Method for Flexible Job Shop Scheduling Problem with Preemption
This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique that has been used widely to reduce completion time of a production system. Due to the complexity of the problem; exact optimization techniques such as branch and bound alg...
متن کاملAn exact Method for Stochastic Maximal Covering Problem of Preventive Healthcare Facilities
Effective preventive healthcare services have a significant role in reducing fatality and medical expenses in all human societies and the level of accessibility of customers to these services can be considered as a measure of their efficiency and effectiveness. The main purpose of this paper is to develop a service network design model of preventive healthcare facilities with the principal obje...
متن کامل